n-Channel Asymmetric Entropy-Constrained Multiple-Description Lattice Vector Quantization

نویسندگان

  • Jan Østergaard
  • Richard Heusdens
  • Jesper Jensen
چکیده

This paper is about the design and analysis of an index-assignment (IA) based multiple-description coding scheme for the n-channel asymmetric case. We use entropy constrained lattice vector quantization and restrict attention to simple reconstruction functions, which are given by the inverse IA function when all descriptions are received or otherwise by a weighted average of the received descriptions. We consider smooth sources with finite differential entropy rate and MSE fidelity criterion. As in previous designs, our construction is based on nested lattices which are combined through a single IA function. The results are exact under high-resolution conditions and asymptotically as the nesting ratios of the lattices approach infinity. For any n, the design is asymptotically optimal. Moreover, in the case of two descriptions and finite lattice vector dimensions greater than one, the performance is strictly better than that of existing designs. In the case of three descriptions, we show that in the limit of large lattice vector dimensions, points on the inner bound of Pradhan et al. can be achieved. Furthermore, for three descriptions and finite lattice vector dimensions, we show that the IA-based approach yields a smaller rate loss than the recently proposed source-splitting approach. Index Terms distributed source coding, high-rate quantization, lattice quantization, multiple description coding, random binning, vector quantization. This research was performed while all authors were at Delft University of Technology, Delft, The Netherlands, and was supported by the Technology Foundation STW, applied science division of NWO and the technology programme of the ministry of Economics Affairs. Jan Østergaard ([email protected]) is now with Aalborg University, Aalborg, Denmark. Richard Heusdens ([email protected]) is with Delft University of Technology, Delft, The Netherlands, and Jesper Jensen ([email protected]) is now with Oticon, Copenhagen, Denmark. This work was presented in part at the International Symposium on Information Theory, 2005 and 2006.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Analysis of Multiple Description Lattice Vector Quantization

Recent results have shown that general K-channel multiple-description-coding (MDC) approaches often have significant advantages over conventional twochannel MDC methods. We provide new asymptotic results to describe the performance of a general K-channel symmetric MDC lattice vector quantizer (MDLVQ). We consider a memoryless L-dimensional source with probability density function f and differen...

متن کامل

Multiple-description vector quantization with lattice codebooks: Design and analysis

The problem of designing a multiple description vector quantizer with lattice codebook Λ is considered. A general solution is given to a labeling problem which plays a crucial role in the design of such quantizers. Numerical performance results are obtained for quantizers based on the lattices A2 and , i = 1, 2, 4, 8, that make use of this labeling algorithm. The high-rate squared-error distort...

متن کامل

A Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding

Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...

متن کامل

Lattice/Trellis based Fixed-rate Entropy-constrained Quantization

The fixed-rate entropy-constrained vector quantizer draws its motivation from the large gap in the performance of the optimal entropy-constrained scalar quantizer (ESCQ) and the fixed-rate LMQ for most non-uniform sources and tries to bridge this gap while maintaining a fixed-rate output. Having a fixed-rate output avoids all problems associated with a variable rate output such as error propaga...

متن کامل

Multiple Description Lattice Vector Quantization Multiple Description Lattice Vector Quantization

This thesis studies the multiple description vector quantization with lattice codebooks (MDLVQ). The design of index assignment is crucial to the performance of MDLVQ. However, to our best knowledge, none of previous index assignment algorithms for MDLVQ is optimal. In this thesis, we propose a simple linear-time index assignment algorithm for MDLVQ with any K ≥ 2 balanced descriptions. We prov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2010